branching program造句
例句与造句
- If the circuit has logarithmic depth, the branching program has polynomial length.
- Lower bounds for multiplication are also known for some classes of branching programs.
- Comparison of polynomials has applications for branching programs ( also called binary decision diagrams ).
- This result does not apply to branching program based boosters but does apply to AdaBoost, LogitBoost, and others.
- Thus, identity of Boolean functions computed by read-once branching programs can be reduced to polynomial identity testing.
- It's difficult to find branching program in a sentence. 用branching program造句挺难的
- We will show that for all 5-cycles ?, there exists a branching program ?-computing " C ".
- The size of the branching program is at most 4 d, where " d " is the depth of the circuit.
- For instance, it implies that the majority function can be computed by a family of branching programs of constant width and polynomial size, while intuition might suggest that to achieve polynomial size, one needs a linear number of states.
- By assuming the subcircuits have branching programs so that they are ?-computing for all 5-cycles ? " " S " 5, we have shown " C " also has this property, as required.
- It is easy to show that every language " L " on { 0, 1 } can be recognized by a family of branching programs of width 5 and exponential length, or by a family of exponential width and linear length.
- A read-once branching program can be represented by a multilinear polynomial which computes ( over any field ) on { 0, 1 }-inputs the same Boolean function as the branching program, and two branching programs compute the same function if and only if the corresponding polynomials are equal.
- A read-once branching program can be represented by a multilinear polynomial which computes ( over any field ) on { 0, 1 }-inputs the same Boolean function as the branching program, and two branching programs compute the same function if and only if the corresponding polynomials are equal.
- A read-once branching program can be represented by a multilinear polynomial which computes ( over any field ) on { 0, 1 }-inputs the same Boolean function as the branching program, and two branching programs compute the same function if and only if the corresponding polynomials are equal.
- In 2003, he received the Knuth Prize for his numerous contributions to the field, including a classic sorting network algorithm ( developed jointly with J . Koml髎 and Endre Szemer閐i ), exponential lower bounds, superlinear time-space tradeoffs for branching programs, and other " unique and spectacular " results.
- Every regular language on { 0, 1 } can be recognized by a family of branching programs of constant width and linear number of instructions ( since a DFA can be converted to a branching program ) . "'BWBP "'denotes the class of languages recognizable by a family of branching programs of bounded width and polynomial length.
更多例句： 下一页